Boolean operations and inclusion test for attribute–element constraints

Topology-Oriented Boolean Operations

This technical report discusses an efficient, topologyoriented method for Boolean operations on polyhedral manifolds. A new spatial hashing technique is proposed for detecting intersections of primitive pairs in linear time complexity. A topology-oriented technique is proposed that classifies the type of intersection using robust geometric predicates. Boolean results are built using finite-prec...

Boolean Constraints for XML Modeling

Derivative Operations for Lattices of Boolean Functions

This paper explores derivative operations of the Boolean differential calculus for lattices of Boolean functions. Such operations are needed to design circuits with short delay and low power consumption [3] as well as to calculate minimal complete sets of fitting test patterns [4]. It will be shown that each derivative operation of a lattice of Boolean functions creates again a lattice of Boole...

INCLUSION TEST FOR GENERAL POLYEilEDRA

This paper presents a new algorithm which tests the inclusion of a point in a general polyhedron, manifold and non-manifold, without solving any equation system and without using trigonometric functions. The algorithm is simple and robust, and easy to apply in every case.

Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints

Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-search methods to compute models of PL(PB)theories. In our approach we view a PL(PB)-theory T as a data structure — a concise representation of a certain propositional CNF theory cl(T ) logically equivalent to T . We sh...